Computer-Generated Proofs of Mathematical Theorems

نویسنده

  • David M. Bressoud
چکیده

algorithm A recipe or set of instructions which, when followed precisely, will produce a desired result. binomial coefficient The binomial coefficient ( n k ) is the coefficient of x in the expansion of (1+x). It counts the number of ways of choosing k objects from a set of n objects. computer algebra system A computer package that enables the computer to do symbolic computations such as algebraic simplification, formal differentiation, and indefinite integration. Diophantine equation An equation in several variables for which only integer solutions are accepted. hypergeometric series A finite or infinite summation, 1 + a1 + · · ·+ ak + · · ·, in which the first term is 1 and the ratio of successive summands, ak+1/ak, is a quotient of polynomials in k. hypergeometric term A function of, say, k that is the kth summand in a hypergeometric series. proof certificate A piece of information about a mathematical statement that makes it possible to prove the statement easily and quickly. proper hypergeometric term A function of two variables such as n and k which is of the form: a polynomial in n and k times xy for some fixed x times a product of quotients of factorials of the form (an+ bk + c)! where a, b, and c are fixed integers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structuring Computer Generated Proofs

One of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation proce-­ dures have been designed in order to state these proofs in a formalism that is more familiar to a human ma-­ thematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs re...

متن کامل

The Boole Lecture A Very Mathematical Dilemma

Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undecidable that there are theorems whose shortest proofs are enormous. Within the last half-century we have discovered practical examples of such theorems: the classification of all finite simple groups, the Four Colour The...

متن کامل

Two Computer-Supported Proofs in Metric Space Topology∗

Every mathematician will agree that the discovery, analysis, and communication of theorems and proofs is at the heart of his or her discipline. A number of computer programs (such as Maple or Mathematica) assist mathematicians in testing conjectures and proving certain kinds of theorems, typically identities involving rational functions or trigonometric polynomials. These systems, however, were...

متن کامل

On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi

A number of program transformations currently of interest can be derived from Wadler's \free theorems" for calculi approximating modern functional languages. Although delicate but fundamental issues arise in proving the correctness of free theorems-based program transformations, these issues are usually left unaddressed in correctness proofs appearing in the literature. As a result, most such p...

متن کامل

Deep Network Guided Proof Search

Deep learning techniques lie at the heart of several significant AI advances in recent years including object recognition and detection, image captioning, machine translation, speech recognition and synthesis, and playing the game of Go. Automated first-order theorem provers can aid in the formalization and verification of mathematical theorems and play a crucial role in program analysis, theor...

متن کامل

A Computer Environment for Writing Ordinary Mathematical Proofs

The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics courses, allows students to easily input mathematical expressions, apply proof strategies, verify logical inference, and apply mathematical rules. Each course has its own language, database of theorems, and mathematic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006